Termination w.r.t. Q of the following Term Rewriting System could not be shown:

Q restricted rewrite system:
The TRS R consists of the following rules:

active1(p1(0)) -> mark1(0)
active1(p1(s1(X))) -> mark1(X)
active1(leq2(0, Y)) -> mark1(true)
active1(leq2(s1(X), 0)) -> mark1(false)
active1(leq2(s1(X), s1(Y))) -> mark1(leq2(X, Y))
active1(if3(true, X, Y)) -> mark1(X)
active1(if3(false, X, Y)) -> mark1(Y)
active1(diff2(X, Y)) -> mark1(if3(leq2(X, Y), 0, s1(diff2(p1(X), Y))))
active1(p1(X)) -> p1(active1(X))
active1(s1(X)) -> s1(active1(X))
active1(leq2(X1, X2)) -> leq2(active1(X1), X2)
active1(leq2(X1, X2)) -> leq2(X1, active1(X2))
active1(if3(X1, X2, X3)) -> if3(active1(X1), X2, X3)
active1(diff2(X1, X2)) -> diff2(active1(X1), X2)
active1(diff2(X1, X2)) -> diff2(X1, active1(X2))
p1(mark1(X)) -> mark1(p1(X))
s1(mark1(X)) -> mark1(s1(X))
leq2(mark1(X1), X2) -> mark1(leq2(X1, X2))
leq2(X1, mark1(X2)) -> mark1(leq2(X1, X2))
if3(mark1(X1), X2, X3) -> mark1(if3(X1, X2, X3))
diff2(mark1(X1), X2) -> mark1(diff2(X1, X2))
diff2(X1, mark1(X2)) -> mark1(diff2(X1, X2))
proper1(p1(X)) -> p1(proper1(X))
proper1(0) -> ok1(0)
proper1(s1(X)) -> s1(proper1(X))
proper1(leq2(X1, X2)) -> leq2(proper1(X1), proper1(X2))
proper1(true) -> ok1(true)
proper1(false) -> ok1(false)
proper1(if3(X1, X2, X3)) -> if3(proper1(X1), proper1(X2), proper1(X3))
proper1(diff2(X1, X2)) -> diff2(proper1(X1), proper1(X2))
p1(ok1(X)) -> ok1(p1(X))
s1(ok1(X)) -> ok1(s1(X))
leq2(ok1(X1), ok1(X2)) -> ok1(leq2(X1, X2))
if3(ok1(X1), ok1(X2), ok1(X3)) -> ok1(if3(X1, X2, X3))
diff2(ok1(X1), ok1(X2)) -> ok1(diff2(X1, X2))
top1(mark1(X)) -> top1(proper1(X))
top1(ok1(X)) -> top1(active1(X))

Q is empty.


↳ QTRS
  ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

active1(p1(0)) -> mark1(0)
active1(p1(s1(X))) -> mark1(X)
active1(leq2(0, Y)) -> mark1(true)
active1(leq2(s1(X), 0)) -> mark1(false)
active1(leq2(s1(X), s1(Y))) -> mark1(leq2(X, Y))
active1(if3(true, X, Y)) -> mark1(X)
active1(if3(false, X, Y)) -> mark1(Y)
active1(diff2(X, Y)) -> mark1(if3(leq2(X, Y), 0, s1(diff2(p1(X), Y))))
active1(p1(X)) -> p1(active1(X))
active1(s1(X)) -> s1(active1(X))
active1(leq2(X1, X2)) -> leq2(active1(X1), X2)
active1(leq2(X1, X2)) -> leq2(X1, active1(X2))
active1(if3(X1, X2, X3)) -> if3(active1(X1), X2, X3)
active1(diff2(X1, X2)) -> diff2(active1(X1), X2)
active1(diff2(X1, X2)) -> diff2(X1, active1(X2))
p1(mark1(X)) -> mark1(p1(X))
s1(mark1(X)) -> mark1(s1(X))
leq2(mark1(X1), X2) -> mark1(leq2(X1, X2))
leq2(X1, mark1(X2)) -> mark1(leq2(X1, X2))
if3(mark1(X1), X2, X3) -> mark1(if3(X1, X2, X3))
diff2(mark1(X1), X2) -> mark1(diff2(X1, X2))
diff2(X1, mark1(X2)) -> mark1(diff2(X1, X2))
proper1(p1(X)) -> p1(proper1(X))
proper1(0) -> ok1(0)
proper1(s1(X)) -> s1(proper1(X))
proper1(leq2(X1, X2)) -> leq2(proper1(X1), proper1(X2))
proper1(true) -> ok1(true)
proper1(false) -> ok1(false)
proper1(if3(X1, X2, X3)) -> if3(proper1(X1), proper1(X2), proper1(X3))
proper1(diff2(X1, X2)) -> diff2(proper1(X1), proper1(X2))
p1(ok1(X)) -> ok1(p1(X))
s1(ok1(X)) -> ok1(s1(X))
leq2(ok1(X1), ok1(X2)) -> ok1(leq2(X1, X2))
if3(ok1(X1), ok1(X2), ok1(X3)) -> ok1(if3(X1, X2, X3))
diff2(ok1(X1), ok1(X2)) -> ok1(diff2(X1, X2))
top1(mark1(X)) -> top1(proper1(X))
top1(ok1(X)) -> top1(active1(X))

Q is empty.

Using Dependency Pairs [1,13] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

LEQ2(mark1(X1), X2) -> LEQ2(X1, X2)
ACTIVE1(diff2(X, Y)) -> P1(X)
P1(mark1(X)) -> P1(X)
LEQ2(X1, mark1(X2)) -> LEQ2(X1, X2)
PROPER1(leq2(X1, X2)) -> LEQ2(proper1(X1), proper1(X2))
ACTIVE1(diff2(X1, X2)) -> DIFF2(active1(X1), X2)
S1(mark1(X)) -> S1(X)
ACTIVE1(p1(X)) -> ACTIVE1(X)
ACTIVE1(leq2(X1, X2)) -> LEQ2(active1(X1), X2)
PROPER1(diff2(X1, X2)) -> PROPER1(X2)
ACTIVE1(if3(X1, X2, X3)) -> IF3(active1(X1), X2, X3)
TOP1(mark1(X)) -> TOP1(proper1(X))
IF3(mark1(X1), X2, X3) -> IF3(X1, X2, X3)
ACTIVE1(diff2(X, Y)) -> LEQ2(X, Y)
ACTIVE1(diff2(X1, X2)) -> ACTIVE1(X1)
ACTIVE1(diff2(X, Y)) -> S1(diff2(p1(X), Y))
ACTIVE1(leq2(s1(X), s1(Y))) -> LEQ2(X, Y)
DIFF2(mark1(X1), X2) -> DIFF2(X1, X2)
P1(ok1(X)) -> P1(X)
ACTIVE1(leq2(X1, X2)) -> LEQ2(X1, active1(X2))
ACTIVE1(leq2(X1, X2)) -> ACTIVE1(X2)
TOP1(ok1(X)) -> ACTIVE1(X)
ACTIVE1(s1(X)) -> S1(active1(X))
PROPER1(s1(X)) -> PROPER1(X)
ACTIVE1(diff2(X, Y)) -> IF3(leq2(X, Y), 0, s1(diff2(p1(X), Y)))
PROPER1(diff2(X1, X2)) -> PROPER1(X1)
PROPER1(p1(X)) -> PROPER1(X)
ACTIVE1(diff2(X1, X2)) -> DIFF2(X1, active1(X2))
TOP1(mark1(X)) -> PROPER1(X)
PROPER1(leq2(X1, X2)) -> PROPER1(X1)
PROPER1(leq2(X1, X2)) -> PROPER1(X2)
DIFF2(ok1(X1), ok1(X2)) -> DIFF2(X1, X2)
ACTIVE1(diff2(X1, X2)) -> ACTIVE1(X2)
PROPER1(if3(X1, X2, X3)) -> PROPER1(X1)
IF3(ok1(X1), ok1(X2), ok1(X3)) -> IF3(X1, X2, X3)
PROPER1(diff2(X1, X2)) -> DIFF2(proper1(X1), proper1(X2))
PROPER1(if3(X1, X2, X3)) -> IF3(proper1(X1), proper1(X2), proper1(X3))
PROPER1(p1(X)) -> P1(proper1(X))
PROPER1(s1(X)) -> S1(proper1(X))
PROPER1(if3(X1, X2, X3)) -> PROPER1(X3)
ACTIVE1(s1(X)) -> ACTIVE1(X)
S1(ok1(X)) -> S1(X)
PROPER1(if3(X1, X2, X3)) -> PROPER1(X2)
DIFF2(X1, mark1(X2)) -> DIFF2(X1, X2)
ACTIVE1(diff2(X, Y)) -> DIFF2(p1(X), Y)
ACTIVE1(leq2(X1, X2)) -> ACTIVE1(X1)
ACTIVE1(p1(X)) -> P1(active1(X))
LEQ2(ok1(X1), ok1(X2)) -> LEQ2(X1, X2)
ACTIVE1(if3(X1, X2, X3)) -> ACTIVE1(X1)
TOP1(ok1(X)) -> TOP1(active1(X))

The TRS R consists of the following rules:

active1(p1(0)) -> mark1(0)
active1(p1(s1(X))) -> mark1(X)
active1(leq2(0, Y)) -> mark1(true)
active1(leq2(s1(X), 0)) -> mark1(false)
active1(leq2(s1(X), s1(Y))) -> mark1(leq2(X, Y))
active1(if3(true, X, Y)) -> mark1(X)
active1(if3(false, X, Y)) -> mark1(Y)
active1(diff2(X, Y)) -> mark1(if3(leq2(X, Y), 0, s1(diff2(p1(X), Y))))
active1(p1(X)) -> p1(active1(X))
active1(s1(X)) -> s1(active1(X))
active1(leq2(X1, X2)) -> leq2(active1(X1), X2)
active1(leq2(X1, X2)) -> leq2(X1, active1(X2))
active1(if3(X1, X2, X3)) -> if3(active1(X1), X2, X3)
active1(diff2(X1, X2)) -> diff2(active1(X1), X2)
active1(diff2(X1, X2)) -> diff2(X1, active1(X2))
p1(mark1(X)) -> mark1(p1(X))
s1(mark1(X)) -> mark1(s1(X))
leq2(mark1(X1), X2) -> mark1(leq2(X1, X2))
leq2(X1, mark1(X2)) -> mark1(leq2(X1, X2))
if3(mark1(X1), X2, X3) -> mark1(if3(X1, X2, X3))
diff2(mark1(X1), X2) -> mark1(diff2(X1, X2))
diff2(X1, mark1(X2)) -> mark1(diff2(X1, X2))
proper1(p1(X)) -> p1(proper1(X))
proper1(0) -> ok1(0)
proper1(s1(X)) -> s1(proper1(X))
proper1(leq2(X1, X2)) -> leq2(proper1(X1), proper1(X2))
proper1(true) -> ok1(true)
proper1(false) -> ok1(false)
proper1(if3(X1, X2, X3)) -> if3(proper1(X1), proper1(X2), proper1(X3))
proper1(diff2(X1, X2)) -> diff2(proper1(X1), proper1(X2))
p1(ok1(X)) -> ok1(p1(X))
s1(ok1(X)) -> ok1(s1(X))
leq2(ok1(X1), ok1(X2)) -> ok1(leq2(X1, X2))
if3(ok1(X1), ok1(X2), ok1(X3)) -> ok1(if3(X1, X2, X3))
diff2(ok1(X1), ok1(X2)) -> ok1(diff2(X1, X2))
top1(mark1(X)) -> top1(proper1(X))
top1(ok1(X)) -> top1(active1(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

LEQ2(mark1(X1), X2) -> LEQ2(X1, X2)
ACTIVE1(diff2(X, Y)) -> P1(X)
P1(mark1(X)) -> P1(X)
LEQ2(X1, mark1(X2)) -> LEQ2(X1, X2)
PROPER1(leq2(X1, X2)) -> LEQ2(proper1(X1), proper1(X2))
ACTIVE1(diff2(X1, X2)) -> DIFF2(active1(X1), X2)
S1(mark1(X)) -> S1(X)
ACTIVE1(p1(X)) -> ACTIVE1(X)
ACTIVE1(leq2(X1, X2)) -> LEQ2(active1(X1), X2)
PROPER1(diff2(X1, X2)) -> PROPER1(X2)
ACTIVE1(if3(X1, X2, X3)) -> IF3(active1(X1), X2, X3)
TOP1(mark1(X)) -> TOP1(proper1(X))
IF3(mark1(X1), X2, X3) -> IF3(X1, X2, X3)
ACTIVE1(diff2(X, Y)) -> LEQ2(X, Y)
ACTIVE1(diff2(X1, X2)) -> ACTIVE1(X1)
ACTIVE1(diff2(X, Y)) -> S1(diff2(p1(X), Y))
ACTIVE1(leq2(s1(X), s1(Y))) -> LEQ2(X, Y)
DIFF2(mark1(X1), X2) -> DIFF2(X1, X2)
P1(ok1(X)) -> P1(X)
ACTIVE1(leq2(X1, X2)) -> LEQ2(X1, active1(X2))
ACTIVE1(leq2(X1, X2)) -> ACTIVE1(X2)
TOP1(ok1(X)) -> ACTIVE1(X)
ACTIVE1(s1(X)) -> S1(active1(X))
PROPER1(s1(X)) -> PROPER1(X)
ACTIVE1(diff2(X, Y)) -> IF3(leq2(X, Y), 0, s1(diff2(p1(X), Y)))
PROPER1(diff2(X1, X2)) -> PROPER1(X1)
PROPER1(p1(X)) -> PROPER1(X)
ACTIVE1(diff2(X1, X2)) -> DIFF2(X1, active1(X2))
TOP1(mark1(X)) -> PROPER1(X)
PROPER1(leq2(X1, X2)) -> PROPER1(X1)
PROPER1(leq2(X1, X2)) -> PROPER1(X2)
DIFF2(ok1(X1), ok1(X2)) -> DIFF2(X1, X2)
ACTIVE1(diff2(X1, X2)) -> ACTIVE1(X2)
PROPER1(if3(X1, X2, X3)) -> PROPER1(X1)
IF3(ok1(X1), ok1(X2), ok1(X3)) -> IF3(X1, X2, X3)
PROPER1(diff2(X1, X2)) -> DIFF2(proper1(X1), proper1(X2))
PROPER1(if3(X1, X2, X3)) -> IF3(proper1(X1), proper1(X2), proper1(X3))
PROPER1(p1(X)) -> P1(proper1(X))
PROPER1(s1(X)) -> S1(proper1(X))
PROPER1(if3(X1, X2, X3)) -> PROPER1(X3)
ACTIVE1(s1(X)) -> ACTIVE1(X)
S1(ok1(X)) -> S1(X)
PROPER1(if3(X1, X2, X3)) -> PROPER1(X2)
DIFF2(X1, mark1(X2)) -> DIFF2(X1, X2)
ACTIVE1(diff2(X, Y)) -> DIFF2(p1(X), Y)
ACTIVE1(leq2(X1, X2)) -> ACTIVE1(X1)
ACTIVE1(p1(X)) -> P1(active1(X))
LEQ2(ok1(X1), ok1(X2)) -> LEQ2(X1, X2)
ACTIVE1(if3(X1, X2, X3)) -> ACTIVE1(X1)
TOP1(ok1(X)) -> TOP1(active1(X))

The TRS R consists of the following rules:

active1(p1(0)) -> mark1(0)
active1(p1(s1(X))) -> mark1(X)
active1(leq2(0, Y)) -> mark1(true)
active1(leq2(s1(X), 0)) -> mark1(false)
active1(leq2(s1(X), s1(Y))) -> mark1(leq2(X, Y))
active1(if3(true, X, Y)) -> mark1(X)
active1(if3(false, X, Y)) -> mark1(Y)
active1(diff2(X, Y)) -> mark1(if3(leq2(X, Y), 0, s1(diff2(p1(X), Y))))
active1(p1(X)) -> p1(active1(X))
active1(s1(X)) -> s1(active1(X))
active1(leq2(X1, X2)) -> leq2(active1(X1), X2)
active1(leq2(X1, X2)) -> leq2(X1, active1(X2))
active1(if3(X1, X2, X3)) -> if3(active1(X1), X2, X3)
active1(diff2(X1, X2)) -> diff2(active1(X1), X2)
active1(diff2(X1, X2)) -> diff2(X1, active1(X2))
p1(mark1(X)) -> mark1(p1(X))
s1(mark1(X)) -> mark1(s1(X))
leq2(mark1(X1), X2) -> mark1(leq2(X1, X2))
leq2(X1, mark1(X2)) -> mark1(leq2(X1, X2))
if3(mark1(X1), X2, X3) -> mark1(if3(X1, X2, X3))
diff2(mark1(X1), X2) -> mark1(diff2(X1, X2))
diff2(X1, mark1(X2)) -> mark1(diff2(X1, X2))
proper1(p1(X)) -> p1(proper1(X))
proper1(0) -> ok1(0)
proper1(s1(X)) -> s1(proper1(X))
proper1(leq2(X1, X2)) -> leq2(proper1(X1), proper1(X2))
proper1(true) -> ok1(true)
proper1(false) -> ok1(false)
proper1(if3(X1, X2, X3)) -> if3(proper1(X1), proper1(X2), proper1(X3))
proper1(diff2(X1, X2)) -> diff2(proper1(X1), proper1(X2))
p1(ok1(X)) -> ok1(p1(X))
s1(ok1(X)) -> ok1(s1(X))
leq2(ok1(X1), ok1(X2)) -> ok1(leq2(X1, X2))
if3(ok1(X1), ok1(X2), ok1(X3)) -> ok1(if3(X1, X2, X3))
diff2(ok1(X1), ok1(X2)) -> ok1(diff2(X1, X2))
top1(mark1(X)) -> top1(proper1(X))
top1(ok1(X)) -> top1(active1(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [13,14,18] contains 8 SCCs with 20 less nodes.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
            ↳ QDPOrderProof
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

DIFF2(X1, mark1(X2)) -> DIFF2(X1, X2)
DIFF2(ok1(X1), ok1(X2)) -> DIFF2(X1, X2)
DIFF2(mark1(X1), X2) -> DIFF2(X1, X2)

The TRS R consists of the following rules:

active1(p1(0)) -> mark1(0)
active1(p1(s1(X))) -> mark1(X)
active1(leq2(0, Y)) -> mark1(true)
active1(leq2(s1(X), 0)) -> mark1(false)
active1(leq2(s1(X), s1(Y))) -> mark1(leq2(X, Y))
active1(if3(true, X, Y)) -> mark1(X)
active1(if3(false, X, Y)) -> mark1(Y)
active1(diff2(X, Y)) -> mark1(if3(leq2(X, Y), 0, s1(diff2(p1(X), Y))))
active1(p1(X)) -> p1(active1(X))
active1(s1(X)) -> s1(active1(X))
active1(leq2(X1, X2)) -> leq2(active1(X1), X2)
active1(leq2(X1, X2)) -> leq2(X1, active1(X2))
active1(if3(X1, X2, X3)) -> if3(active1(X1), X2, X3)
active1(diff2(X1, X2)) -> diff2(active1(X1), X2)
active1(diff2(X1, X2)) -> diff2(X1, active1(X2))
p1(mark1(X)) -> mark1(p1(X))
s1(mark1(X)) -> mark1(s1(X))
leq2(mark1(X1), X2) -> mark1(leq2(X1, X2))
leq2(X1, mark1(X2)) -> mark1(leq2(X1, X2))
if3(mark1(X1), X2, X3) -> mark1(if3(X1, X2, X3))
diff2(mark1(X1), X2) -> mark1(diff2(X1, X2))
diff2(X1, mark1(X2)) -> mark1(diff2(X1, X2))
proper1(p1(X)) -> p1(proper1(X))
proper1(0) -> ok1(0)
proper1(s1(X)) -> s1(proper1(X))
proper1(leq2(X1, X2)) -> leq2(proper1(X1), proper1(X2))
proper1(true) -> ok1(true)
proper1(false) -> ok1(false)
proper1(if3(X1, X2, X3)) -> if3(proper1(X1), proper1(X2), proper1(X3))
proper1(diff2(X1, X2)) -> diff2(proper1(X1), proper1(X2))
p1(ok1(X)) -> ok1(p1(X))
s1(ok1(X)) -> ok1(s1(X))
leq2(ok1(X1), ok1(X2)) -> ok1(leq2(X1, X2))
if3(ok1(X1), ok1(X2), ok1(X3)) -> ok1(if3(X1, X2, X3))
diff2(ok1(X1), ok1(X2)) -> ok1(diff2(X1, X2))
top1(mark1(X)) -> top1(proper1(X))
top1(ok1(X)) -> top1(active1(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].


The following pairs can be oriented strictly and are deleted.


DIFF2(ok1(X1), ok1(X2)) -> DIFF2(X1, X2)
DIFF2(mark1(X1), X2) -> DIFF2(X1, X2)
The remaining pairs can at least be oriented weakly.

DIFF2(X1, mark1(X2)) -> DIFF2(X1, X2)
Used ordering: Polynomial interpretation [21]:

POL(DIFF2(x1, x2)) = x1   
POL(mark1(x1)) = 1 + x1   
POL(ok1(x1)) = 1 + x1   

The following usable rules [14] were oriented: none



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
            ↳ QDPOrderProof
              ↳ QDP
                ↳ QDPOrderProof
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

DIFF2(X1, mark1(X2)) -> DIFF2(X1, X2)

The TRS R consists of the following rules:

active1(p1(0)) -> mark1(0)
active1(p1(s1(X))) -> mark1(X)
active1(leq2(0, Y)) -> mark1(true)
active1(leq2(s1(X), 0)) -> mark1(false)
active1(leq2(s1(X), s1(Y))) -> mark1(leq2(X, Y))
active1(if3(true, X, Y)) -> mark1(X)
active1(if3(false, X, Y)) -> mark1(Y)
active1(diff2(X, Y)) -> mark1(if3(leq2(X, Y), 0, s1(diff2(p1(X), Y))))
active1(p1(X)) -> p1(active1(X))
active1(s1(X)) -> s1(active1(X))
active1(leq2(X1, X2)) -> leq2(active1(X1), X2)
active1(leq2(X1, X2)) -> leq2(X1, active1(X2))
active1(if3(X1, X2, X3)) -> if3(active1(X1), X2, X3)
active1(diff2(X1, X2)) -> diff2(active1(X1), X2)
active1(diff2(X1, X2)) -> diff2(X1, active1(X2))
p1(mark1(X)) -> mark1(p1(X))
s1(mark1(X)) -> mark1(s1(X))
leq2(mark1(X1), X2) -> mark1(leq2(X1, X2))
leq2(X1, mark1(X2)) -> mark1(leq2(X1, X2))
if3(mark1(X1), X2, X3) -> mark1(if3(X1, X2, X3))
diff2(mark1(X1), X2) -> mark1(diff2(X1, X2))
diff2(X1, mark1(X2)) -> mark1(diff2(X1, X2))
proper1(p1(X)) -> p1(proper1(X))
proper1(0) -> ok1(0)
proper1(s1(X)) -> s1(proper1(X))
proper1(leq2(X1, X2)) -> leq2(proper1(X1), proper1(X2))
proper1(true) -> ok1(true)
proper1(false) -> ok1(false)
proper1(if3(X1, X2, X3)) -> if3(proper1(X1), proper1(X2), proper1(X3))
proper1(diff2(X1, X2)) -> diff2(proper1(X1), proper1(X2))
p1(ok1(X)) -> ok1(p1(X))
s1(ok1(X)) -> ok1(s1(X))
leq2(ok1(X1), ok1(X2)) -> ok1(leq2(X1, X2))
if3(ok1(X1), ok1(X2), ok1(X3)) -> ok1(if3(X1, X2, X3))
diff2(ok1(X1), ok1(X2)) -> ok1(diff2(X1, X2))
top1(mark1(X)) -> top1(proper1(X))
top1(ok1(X)) -> top1(active1(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].


The following pairs can be oriented strictly and are deleted.


DIFF2(X1, mark1(X2)) -> DIFF2(X1, X2)
The remaining pairs can at least be oriented weakly.
none
Used ordering: Polynomial interpretation [21]:

POL(DIFF2(x1, x2)) = x2   
POL(mark1(x1)) = 1 + x1   

The following usable rules [14] were oriented: none



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
            ↳ QDPOrderProof
              ↳ QDP
                ↳ QDPOrderProof
                  ↳ QDP
                    ↳ PisEmptyProof
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

active1(p1(0)) -> mark1(0)
active1(p1(s1(X))) -> mark1(X)
active1(leq2(0, Y)) -> mark1(true)
active1(leq2(s1(X), 0)) -> mark1(false)
active1(leq2(s1(X), s1(Y))) -> mark1(leq2(X, Y))
active1(if3(true, X, Y)) -> mark1(X)
active1(if3(false, X, Y)) -> mark1(Y)
active1(diff2(X, Y)) -> mark1(if3(leq2(X, Y), 0, s1(diff2(p1(X), Y))))
active1(p1(X)) -> p1(active1(X))
active1(s1(X)) -> s1(active1(X))
active1(leq2(X1, X2)) -> leq2(active1(X1), X2)
active1(leq2(X1, X2)) -> leq2(X1, active1(X2))
active1(if3(X1, X2, X3)) -> if3(active1(X1), X2, X3)
active1(diff2(X1, X2)) -> diff2(active1(X1), X2)
active1(diff2(X1, X2)) -> diff2(X1, active1(X2))
p1(mark1(X)) -> mark1(p1(X))
s1(mark1(X)) -> mark1(s1(X))
leq2(mark1(X1), X2) -> mark1(leq2(X1, X2))
leq2(X1, mark1(X2)) -> mark1(leq2(X1, X2))
if3(mark1(X1), X2, X3) -> mark1(if3(X1, X2, X3))
diff2(mark1(X1), X2) -> mark1(diff2(X1, X2))
diff2(X1, mark1(X2)) -> mark1(diff2(X1, X2))
proper1(p1(X)) -> p1(proper1(X))
proper1(0) -> ok1(0)
proper1(s1(X)) -> s1(proper1(X))
proper1(leq2(X1, X2)) -> leq2(proper1(X1), proper1(X2))
proper1(true) -> ok1(true)
proper1(false) -> ok1(false)
proper1(if3(X1, X2, X3)) -> if3(proper1(X1), proper1(X2), proper1(X3))
proper1(diff2(X1, X2)) -> diff2(proper1(X1), proper1(X2))
p1(ok1(X)) -> ok1(p1(X))
s1(ok1(X)) -> ok1(s1(X))
leq2(ok1(X1), ok1(X2)) -> ok1(leq2(X1, X2))
if3(ok1(X1), ok1(X2), ok1(X3)) -> ok1(if3(X1, X2, X3))
diff2(ok1(X1), ok1(X2)) -> ok1(diff2(X1, X2))
top1(mark1(X)) -> top1(proper1(X))
top1(ok1(X)) -> top1(active1(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
            ↳ QDPOrderProof
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

IF3(mark1(X1), X2, X3) -> IF3(X1, X2, X3)
IF3(ok1(X1), ok1(X2), ok1(X3)) -> IF3(X1, X2, X3)

The TRS R consists of the following rules:

active1(p1(0)) -> mark1(0)
active1(p1(s1(X))) -> mark1(X)
active1(leq2(0, Y)) -> mark1(true)
active1(leq2(s1(X), 0)) -> mark1(false)
active1(leq2(s1(X), s1(Y))) -> mark1(leq2(X, Y))
active1(if3(true, X, Y)) -> mark1(X)
active1(if3(false, X, Y)) -> mark1(Y)
active1(diff2(X, Y)) -> mark1(if3(leq2(X, Y), 0, s1(diff2(p1(X), Y))))
active1(p1(X)) -> p1(active1(X))
active1(s1(X)) -> s1(active1(X))
active1(leq2(X1, X2)) -> leq2(active1(X1), X2)
active1(leq2(X1, X2)) -> leq2(X1, active1(X2))
active1(if3(X1, X2, X3)) -> if3(active1(X1), X2, X3)
active1(diff2(X1, X2)) -> diff2(active1(X1), X2)
active1(diff2(X1, X2)) -> diff2(X1, active1(X2))
p1(mark1(X)) -> mark1(p1(X))
s1(mark1(X)) -> mark1(s1(X))
leq2(mark1(X1), X2) -> mark1(leq2(X1, X2))
leq2(X1, mark1(X2)) -> mark1(leq2(X1, X2))
if3(mark1(X1), X2, X3) -> mark1(if3(X1, X2, X3))
diff2(mark1(X1), X2) -> mark1(diff2(X1, X2))
diff2(X1, mark1(X2)) -> mark1(diff2(X1, X2))
proper1(p1(X)) -> p1(proper1(X))
proper1(0) -> ok1(0)
proper1(s1(X)) -> s1(proper1(X))
proper1(leq2(X1, X2)) -> leq2(proper1(X1), proper1(X2))
proper1(true) -> ok1(true)
proper1(false) -> ok1(false)
proper1(if3(X1, X2, X3)) -> if3(proper1(X1), proper1(X2), proper1(X3))
proper1(diff2(X1, X2)) -> diff2(proper1(X1), proper1(X2))
p1(ok1(X)) -> ok1(p1(X))
s1(ok1(X)) -> ok1(s1(X))
leq2(ok1(X1), ok1(X2)) -> ok1(leq2(X1, X2))
if3(ok1(X1), ok1(X2), ok1(X3)) -> ok1(if3(X1, X2, X3))
diff2(ok1(X1), ok1(X2)) -> ok1(diff2(X1, X2))
top1(mark1(X)) -> top1(proper1(X))
top1(ok1(X)) -> top1(active1(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].


The following pairs can be oriented strictly and are deleted.


IF3(ok1(X1), ok1(X2), ok1(X3)) -> IF3(X1, X2, X3)
The remaining pairs can at least be oriented weakly.

IF3(mark1(X1), X2, X3) -> IF3(X1, X2, X3)
Used ordering: Polynomial interpretation [21]:

POL(IF3(x1, x2, x3)) = x2 + x3   
POL(mark1(x1)) = 0   
POL(ok1(x1)) = 1 + x1   

The following usable rules [14] were oriented: none



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
            ↳ QDPOrderProof
              ↳ QDP
                ↳ QDPOrderProof
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

IF3(mark1(X1), X2, X3) -> IF3(X1, X2, X3)

The TRS R consists of the following rules:

active1(p1(0)) -> mark1(0)
active1(p1(s1(X))) -> mark1(X)
active1(leq2(0, Y)) -> mark1(true)
active1(leq2(s1(X), 0)) -> mark1(false)
active1(leq2(s1(X), s1(Y))) -> mark1(leq2(X, Y))
active1(if3(true, X, Y)) -> mark1(X)
active1(if3(false, X, Y)) -> mark1(Y)
active1(diff2(X, Y)) -> mark1(if3(leq2(X, Y), 0, s1(diff2(p1(X), Y))))
active1(p1(X)) -> p1(active1(X))
active1(s1(X)) -> s1(active1(X))
active1(leq2(X1, X2)) -> leq2(active1(X1), X2)
active1(leq2(X1, X2)) -> leq2(X1, active1(X2))
active1(if3(X1, X2, X3)) -> if3(active1(X1), X2, X3)
active1(diff2(X1, X2)) -> diff2(active1(X1), X2)
active1(diff2(X1, X2)) -> diff2(X1, active1(X2))
p1(mark1(X)) -> mark1(p1(X))
s1(mark1(X)) -> mark1(s1(X))
leq2(mark1(X1), X2) -> mark1(leq2(X1, X2))
leq2(X1, mark1(X2)) -> mark1(leq2(X1, X2))
if3(mark1(X1), X2, X3) -> mark1(if3(X1, X2, X3))
diff2(mark1(X1), X2) -> mark1(diff2(X1, X2))
diff2(X1, mark1(X2)) -> mark1(diff2(X1, X2))
proper1(p1(X)) -> p1(proper1(X))
proper1(0) -> ok1(0)
proper1(s1(X)) -> s1(proper1(X))
proper1(leq2(X1, X2)) -> leq2(proper1(X1), proper1(X2))
proper1(true) -> ok1(true)
proper1(false) -> ok1(false)
proper1(if3(X1, X2, X3)) -> if3(proper1(X1), proper1(X2), proper1(X3))
proper1(diff2(X1, X2)) -> diff2(proper1(X1), proper1(X2))
p1(ok1(X)) -> ok1(p1(X))
s1(ok1(X)) -> ok1(s1(X))
leq2(ok1(X1), ok1(X2)) -> ok1(leq2(X1, X2))
if3(ok1(X1), ok1(X2), ok1(X3)) -> ok1(if3(X1, X2, X3))
diff2(ok1(X1), ok1(X2)) -> ok1(diff2(X1, X2))
top1(mark1(X)) -> top1(proper1(X))
top1(ok1(X)) -> top1(active1(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].


The following pairs can be oriented strictly and are deleted.


IF3(mark1(X1), X2, X3) -> IF3(X1, X2, X3)
The remaining pairs can at least be oriented weakly.
none
Used ordering: Polynomial interpretation [21]:

POL(IF3(x1, x2, x3)) = x1   
POL(mark1(x1)) = 1 + x1   

The following usable rules [14] were oriented: none



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
            ↳ QDPOrderProof
              ↳ QDP
                ↳ QDPOrderProof
                  ↳ QDP
                    ↳ PisEmptyProof
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

active1(p1(0)) -> mark1(0)
active1(p1(s1(X))) -> mark1(X)
active1(leq2(0, Y)) -> mark1(true)
active1(leq2(s1(X), 0)) -> mark1(false)
active1(leq2(s1(X), s1(Y))) -> mark1(leq2(X, Y))
active1(if3(true, X, Y)) -> mark1(X)
active1(if3(false, X, Y)) -> mark1(Y)
active1(diff2(X, Y)) -> mark1(if3(leq2(X, Y), 0, s1(diff2(p1(X), Y))))
active1(p1(X)) -> p1(active1(X))
active1(s1(X)) -> s1(active1(X))
active1(leq2(X1, X2)) -> leq2(active1(X1), X2)
active1(leq2(X1, X2)) -> leq2(X1, active1(X2))
active1(if3(X1, X2, X3)) -> if3(active1(X1), X2, X3)
active1(diff2(X1, X2)) -> diff2(active1(X1), X2)
active1(diff2(X1, X2)) -> diff2(X1, active1(X2))
p1(mark1(X)) -> mark1(p1(X))
s1(mark1(X)) -> mark1(s1(X))
leq2(mark1(X1), X2) -> mark1(leq2(X1, X2))
leq2(X1, mark1(X2)) -> mark1(leq2(X1, X2))
if3(mark1(X1), X2, X3) -> mark1(if3(X1, X2, X3))
diff2(mark1(X1), X2) -> mark1(diff2(X1, X2))
diff2(X1, mark1(X2)) -> mark1(diff2(X1, X2))
proper1(p1(X)) -> p1(proper1(X))
proper1(0) -> ok1(0)
proper1(s1(X)) -> s1(proper1(X))
proper1(leq2(X1, X2)) -> leq2(proper1(X1), proper1(X2))
proper1(true) -> ok1(true)
proper1(false) -> ok1(false)
proper1(if3(X1, X2, X3)) -> if3(proper1(X1), proper1(X2), proper1(X3))
proper1(diff2(X1, X2)) -> diff2(proper1(X1), proper1(X2))
p1(ok1(X)) -> ok1(p1(X))
s1(ok1(X)) -> ok1(s1(X))
leq2(ok1(X1), ok1(X2)) -> ok1(leq2(X1, X2))
if3(ok1(X1), ok1(X2), ok1(X3)) -> ok1(if3(X1, X2, X3))
diff2(ok1(X1), ok1(X2)) -> ok1(diff2(X1, X2))
top1(mark1(X)) -> top1(proper1(X))
top1(ok1(X)) -> top1(active1(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
            ↳ QDPOrderProof
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

LEQ2(ok1(X1), ok1(X2)) -> LEQ2(X1, X2)
LEQ2(mark1(X1), X2) -> LEQ2(X1, X2)
LEQ2(X1, mark1(X2)) -> LEQ2(X1, X2)

The TRS R consists of the following rules:

active1(p1(0)) -> mark1(0)
active1(p1(s1(X))) -> mark1(X)
active1(leq2(0, Y)) -> mark1(true)
active1(leq2(s1(X), 0)) -> mark1(false)
active1(leq2(s1(X), s1(Y))) -> mark1(leq2(X, Y))
active1(if3(true, X, Y)) -> mark1(X)
active1(if3(false, X, Y)) -> mark1(Y)
active1(diff2(X, Y)) -> mark1(if3(leq2(X, Y), 0, s1(diff2(p1(X), Y))))
active1(p1(X)) -> p1(active1(X))
active1(s1(X)) -> s1(active1(X))
active1(leq2(X1, X2)) -> leq2(active1(X1), X2)
active1(leq2(X1, X2)) -> leq2(X1, active1(X2))
active1(if3(X1, X2, X3)) -> if3(active1(X1), X2, X3)
active1(diff2(X1, X2)) -> diff2(active1(X1), X2)
active1(diff2(X1, X2)) -> diff2(X1, active1(X2))
p1(mark1(X)) -> mark1(p1(X))
s1(mark1(X)) -> mark1(s1(X))
leq2(mark1(X1), X2) -> mark1(leq2(X1, X2))
leq2(X1, mark1(X2)) -> mark1(leq2(X1, X2))
if3(mark1(X1), X2, X3) -> mark1(if3(X1, X2, X3))
diff2(mark1(X1), X2) -> mark1(diff2(X1, X2))
diff2(X1, mark1(X2)) -> mark1(diff2(X1, X2))
proper1(p1(X)) -> p1(proper1(X))
proper1(0) -> ok1(0)
proper1(s1(X)) -> s1(proper1(X))
proper1(leq2(X1, X2)) -> leq2(proper1(X1), proper1(X2))
proper1(true) -> ok1(true)
proper1(false) -> ok1(false)
proper1(if3(X1, X2, X3)) -> if3(proper1(X1), proper1(X2), proper1(X3))
proper1(diff2(X1, X2)) -> diff2(proper1(X1), proper1(X2))
p1(ok1(X)) -> ok1(p1(X))
s1(ok1(X)) -> ok1(s1(X))
leq2(ok1(X1), ok1(X2)) -> ok1(leq2(X1, X2))
if3(ok1(X1), ok1(X2), ok1(X3)) -> ok1(if3(X1, X2, X3))
diff2(ok1(X1), ok1(X2)) -> ok1(diff2(X1, X2))
top1(mark1(X)) -> top1(proper1(X))
top1(ok1(X)) -> top1(active1(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].


The following pairs can be oriented strictly and are deleted.


LEQ2(ok1(X1), ok1(X2)) -> LEQ2(X1, X2)
LEQ2(X1, mark1(X2)) -> LEQ2(X1, X2)
The remaining pairs can at least be oriented weakly.

LEQ2(mark1(X1), X2) -> LEQ2(X1, X2)
Used ordering: Polynomial interpretation [21]:

POL(LEQ2(x1, x2)) = x2   
POL(mark1(x1)) = 1 + x1   
POL(ok1(x1)) = 1 + x1   

The following usable rules [14] were oriented: none



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
            ↳ QDPOrderProof
              ↳ QDP
                ↳ QDPOrderProof
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

LEQ2(mark1(X1), X2) -> LEQ2(X1, X2)

The TRS R consists of the following rules:

active1(p1(0)) -> mark1(0)
active1(p1(s1(X))) -> mark1(X)
active1(leq2(0, Y)) -> mark1(true)
active1(leq2(s1(X), 0)) -> mark1(false)
active1(leq2(s1(X), s1(Y))) -> mark1(leq2(X, Y))
active1(if3(true, X, Y)) -> mark1(X)
active1(if3(false, X, Y)) -> mark1(Y)
active1(diff2(X, Y)) -> mark1(if3(leq2(X, Y), 0, s1(diff2(p1(X), Y))))
active1(p1(X)) -> p1(active1(X))
active1(s1(X)) -> s1(active1(X))
active1(leq2(X1, X2)) -> leq2(active1(X1), X2)
active1(leq2(X1, X2)) -> leq2(X1, active1(X2))
active1(if3(X1, X2, X3)) -> if3(active1(X1), X2, X3)
active1(diff2(X1, X2)) -> diff2(active1(X1), X2)
active1(diff2(X1, X2)) -> diff2(X1, active1(X2))
p1(mark1(X)) -> mark1(p1(X))
s1(mark1(X)) -> mark1(s1(X))
leq2(mark1(X1), X2) -> mark1(leq2(X1, X2))
leq2(X1, mark1(X2)) -> mark1(leq2(X1, X2))
if3(mark1(X1), X2, X3) -> mark1(if3(X1, X2, X3))
diff2(mark1(X1), X2) -> mark1(diff2(X1, X2))
diff2(X1, mark1(X2)) -> mark1(diff2(X1, X2))
proper1(p1(X)) -> p1(proper1(X))
proper1(0) -> ok1(0)
proper1(s1(X)) -> s1(proper1(X))
proper1(leq2(X1, X2)) -> leq2(proper1(X1), proper1(X2))
proper1(true) -> ok1(true)
proper1(false) -> ok1(false)
proper1(if3(X1, X2, X3)) -> if3(proper1(X1), proper1(X2), proper1(X3))
proper1(diff2(X1, X2)) -> diff2(proper1(X1), proper1(X2))
p1(ok1(X)) -> ok1(p1(X))
s1(ok1(X)) -> ok1(s1(X))
leq2(ok1(X1), ok1(X2)) -> ok1(leq2(X1, X2))
if3(ok1(X1), ok1(X2), ok1(X3)) -> ok1(if3(X1, X2, X3))
diff2(ok1(X1), ok1(X2)) -> ok1(diff2(X1, X2))
top1(mark1(X)) -> top1(proper1(X))
top1(ok1(X)) -> top1(active1(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].


The following pairs can be oriented strictly and are deleted.


LEQ2(mark1(X1), X2) -> LEQ2(X1, X2)
The remaining pairs can at least be oriented weakly.
none
Used ordering: Polynomial interpretation [21]:

POL(LEQ2(x1, x2)) = x1   
POL(mark1(x1)) = 1 + x1   

The following usable rules [14] were oriented: none



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
            ↳ QDPOrderProof
              ↳ QDP
                ↳ QDPOrderProof
                  ↳ QDP
                    ↳ PisEmptyProof
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

active1(p1(0)) -> mark1(0)
active1(p1(s1(X))) -> mark1(X)
active1(leq2(0, Y)) -> mark1(true)
active1(leq2(s1(X), 0)) -> mark1(false)
active1(leq2(s1(X), s1(Y))) -> mark1(leq2(X, Y))
active1(if3(true, X, Y)) -> mark1(X)
active1(if3(false, X, Y)) -> mark1(Y)
active1(diff2(X, Y)) -> mark1(if3(leq2(X, Y), 0, s1(diff2(p1(X), Y))))
active1(p1(X)) -> p1(active1(X))
active1(s1(X)) -> s1(active1(X))
active1(leq2(X1, X2)) -> leq2(active1(X1), X2)
active1(leq2(X1, X2)) -> leq2(X1, active1(X2))
active1(if3(X1, X2, X3)) -> if3(active1(X1), X2, X3)
active1(diff2(X1, X2)) -> diff2(active1(X1), X2)
active1(diff2(X1, X2)) -> diff2(X1, active1(X2))
p1(mark1(X)) -> mark1(p1(X))
s1(mark1(X)) -> mark1(s1(X))
leq2(mark1(X1), X2) -> mark1(leq2(X1, X2))
leq2(X1, mark1(X2)) -> mark1(leq2(X1, X2))
if3(mark1(X1), X2, X3) -> mark1(if3(X1, X2, X3))
diff2(mark1(X1), X2) -> mark1(diff2(X1, X2))
diff2(X1, mark1(X2)) -> mark1(diff2(X1, X2))
proper1(p1(X)) -> p1(proper1(X))
proper1(0) -> ok1(0)
proper1(s1(X)) -> s1(proper1(X))
proper1(leq2(X1, X2)) -> leq2(proper1(X1), proper1(X2))
proper1(true) -> ok1(true)
proper1(false) -> ok1(false)
proper1(if3(X1, X2, X3)) -> if3(proper1(X1), proper1(X2), proper1(X3))
proper1(diff2(X1, X2)) -> diff2(proper1(X1), proper1(X2))
p1(ok1(X)) -> ok1(p1(X))
s1(ok1(X)) -> ok1(s1(X))
leq2(ok1(X1), ok1(X2)) -> ok1(leq2(X1, X2))
if3(ok1(X1), ok1(X2), ok1(X3)) -> ok1(if3(X1, X2, X3))
diff2(ok1(X1), ok1(X2)) -> ok1(diff2(X1, X2))
top1(mark1(X)) -> top1(proper1(X))
top1(ok1(X)) -> top1(active1(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
            ↳ QDPOrderProof
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

S1(ok1(X)) -> S1(X)
S1(mark1(X)) -> S1(X)

The TRS R consists of the following rules:

active1(p1(0)) -> mark1(0)
active1(p1(s1(X))) -> mark1(X)
active1(leq2(0, Y)) -> mark1(true)
active1(leq2(s1(X), 0)) -> mark1(false)
active1(leq2(s1(X), s1(Y))) -> mark1(leq2(X, Y))
active1(if3(true, X, Y)) -> mark1(X)
active1(if3(false, X, Y)) -> mark1(Y)
active1(diff2(X, Y)) -> mark1(if3(leq2(X, Y), 0, s1(diff2(p1(X), Y))))
active1(p1(X)) -> p1(active1(X))
active1(s1(X)) -> s1(active1(X))
active1(leq2(X1, X2)) -> leq2(active1(X1), X2)
active1(leq2(X1, X2)) -> leq2(X1, active1(X2))
active1(if3(X1, X2, X3)) -> if3(active1(X1), X2, X3)
active1(diff2(X1, X2)) -> diff2(active1(X1), X2)
active1(diff2(X1, X2)) -> diff2(X1, active1(X2))
p1(mark1(X)) -> mark1(p1(X))
s1(mark1(X)) -> mark1(s1(X))
leq2(mark1(X1), X2) -> mark1(leq2(X1, X2))
leq2(X1, mark1(X2)) -> mark1(leq2(X1, X2))
if3(mark1(X1), X2, X3) -> mark1(if3(X1, X2, X3))
diff2(mark1(X1), X2) -> mark1(diff2(X1, X2))
diff2(X1, mark1(X2)) -> mark1(diff2(X1, X2))
proper1(p1(X)) -> p1(proper1(X))
proper1(0) -> ok1(0)
proper1(s1(X)) -> s1(proper1(X))
proper1(leq2(X1, X2)) -> leq2(proper1(X1), proper1(X2))
proper1(true) -> ok1(true)
proper1(false) -> ok1(false)
proper1(if3(X1, X2, X3)) -> if3(proper1(X1), proper1(X2), proper1(X3))
proper1(diff2(X1, X2)) -> diff2(proper1(X1), proper1(X2))
p1(ok1(X)) -> ok1(p1(X))
s1(ok1(X)) -> ok1(s1(X))
leq2(ok1(X1), ok1(X2)) -> ok1(leq2(X1, X2))
if3(ok1(X1), ok1(X2), ok1(X3)) -> ok1(if3(X1, X2, X3))
diff2(ok1(X1), ok1(X2)) -> ok1(diff2(X1, X2))
top1(mark1(X)) -> top1(proper1(X))
top1(ok1(X)) -> top1(active1(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].


The following pairs can be oriented strictly and are deleted.


S1(ok1(X)) -> S1(X)
S1(mark1(X)) -> S1(X)
The remaining pairs can at least be oriented weakly.
none
Used ordering: Polynomial interpretation [21]:

POL(S1(x1)) = x1   
POL(mark1(x1)) = 1 + x1   
POL(ok1(x1)) = 1 + x1   

The following usable rules [14] were oriented: none



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
            ↳ QDPOrderProof
              ↳ QDP
                ↳ PisEmptyProof
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

active1(p1(0)) -> mark1(0)
active1(p1(s1(X))) -> mark1(X)
active1(leq2(0, Y)) -> mark1(true)
active1(leq2(s1(X), 0)) -> mark1(false)
active1(leq2(s1(X), s1(Y))) -> mark1(leq2(X, Y))
active1(if3(true, X, Y)) -> mark1(X)
active1(if3(false, X, Y)) -> mark1(Y)
active1(diff2(X, Y)) -> mark1(if3(leq2(X, Y), 0, s1(diff2(p1(X), Y))))
active1(p1(X)) -> p1(active1(X))
active1(s1(X)) -> s1(active1(X))
active1(leq2(X1, X2)) -> leq2(active1(X1), X2)
active1(leq2(X1, X2)) -> leq2(X1, active1(X2))
active1(if3(X1, X2, X3)) -> if3(active1(X1), X2, X3)
active1(diff2(X1, X2)) -> diff2(active1(X1), X2)
active1(diff2(X1, X2)) -> diff2(X1, active1(X2))
p1(mark1(X)) -> mark1(p1(X))
s1(mark1(X)) -> mark1(s1(X))
leq2(mark1(X1), X2) -> mark1(leq2(X1, X2))
leq2(X1, mark1(X2)) -> mark1(leq2(X1, X2))
if3(mark1(X1), X2, X3) -> mark1(if3(X1, X2, X3))
diff2(mark1(X1), X2) -> mark1(diff2(X1, X2))
diff2(X1, mark1(X2)) -> mark1(diff2(X1, X2))
proper1(p1(X)) -> p1(proper1(X))
proper1(0) -> ok1(0)
proper1(s1(X)) -> s1(proper1(X))
proper1(leq2(X1, X2)) -> leq2(proper1(X1), proper1(X2))
proper1(true) -> ok1(true)
proper1(false) -> ok1(false)
proper1(if3(X1, X2, X3)) -> if3(proper1(X1), proper1(X2), proper1(X3))
proper1(diff2(X1, X2)) -> diff2(proper1(X1), proper1(X2))
p1(ok1(X)) -> ok1(p1(X))
s1(ok1(X)) -> ok1(s1(X))
leq2(ok1(X1), ok1(X2)) -> ok1(leq2(X1, X2))
if3(ok1(X1), ok1(X2), ok1(X3)) -> ok1(if3(X1, X2, X3))
diff2(ok1(X1), ok1(X2)) -> ok1(diff2(X1, X2))
top1(mark1(X)) -> top1(proper1(X))
top1(ok1(X)) -> top1(active1(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
            ↳ QDPOrderProof
          ↳ QDP
          ↳ QDP
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

P1(mark1(X)) -> P1(X)
P1(ok1(X)) -> P1(X)

The TRS R consists of the following rules:

active1(p1(0)) -> mark1(0)
active1(p1(s1(X))) -> mark1(X)
active1(leq2(0, Y)) -> mark1(true)
active1(leq2(s1(X), 0)) -> mark1(false)
active1(leq2(s1(X), s1(Y))) -> mark1(leq2(X, Y))
active1(if3(true, X, Y)) -> mark1(X)
active1(if3(false, X, Y)) -> mark1(Y)
active1(diff2(X, Y)) -> mark1(if3(leq2(X, Y), 0, s1(diff2(p1(X), Y))))
active1(p1(X)) -> p1(active1(X))
active1(s1(X)) -> s1(active1(X))
active1(leq2(X1, X2)) -> leq2(active1(X1), X2)
active1(leq2(X1, X2)) -> leq2(X1, active1(X2))
active1(if3(X1, X2, X3)) -> if3(active1(X1), X2, X3)
active1(diff2(X1, X2)) -> diff2(active1(X1), X2)
active1(diff2(X1, X2)) -> diff2(X1, active1(X2))
p1(mark1(X)) -> mark1(p1(X))
s1(mark1(X)) -> mark1(s1(X))
leq2(mark1(X1), X2) -> mark1(leq2(X1, X2))
leq2(X1, mark1(X2)) -> mark1(leq2(X1, X2))
if3(mark1(X1), X2, X3) -> mark1(if3(X1, X2, X3))
diff2(mark1(X1), X2) -> mark1(diff2(X1, X2))
diff2(X1, mark1(X2)) -> mark1(diff2(X1, X2))
proper1(p1(X)) -> p1(proper1(X))
proper1(0) -> ok1(0)
proper1(s1(X)) -> s1(proper1(X))
proper1(leq2(X1, X2)) -> leq2(proper1(X1), proper1(X2))
proper1(true) -> ok1(true)
proper1(false) -> ok1(false)
proper1(if3(X1, X2, X3)) -> if3(proper1(X1), proper1(X2), proper1(X3))
proper1(diff2(X1, X2)) -> diff2(proper1(X1), proper1(X2))
p1(ok1(X)) -> ok1(p1(X))
s1(ok1(X)) -> ok1(s1(X))
leq2(ok1(X1), ok1(X2)) -> ok1(leq2(X1, X2))
if3(ok1(X1), ok1(X2), ok1(X3)) -> ok1(if3(X1, X2, X3))
diff2(ok1(X1), ok1(X2)) -> ok1(diff2(X1, X2))
top1(mark1(X)) -> top1(proper1(X))
top1(ok1(X)) -> top1(active1(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].


The following pairs can be oriented strictly and are deleted.


P1(mark1(X)) -> P1(X)
P1(ok1(X)) -> P1(X)
The remaining pairs can at least be oriented weakly.
none
Used ordering: Polynomial interpretation [21]:

POL(P1(x1)) = x1   
POL(mark1(x1)) = 1 + x1   
POL(ok1(x1)) = 1 + x1   

The following usable rules [14] were oriented: none



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
            ↳ QDPOrderProof
              ↳ QDP
                ↳ PisEmptyProof
          ↳ QDP
          ↳ QDP
          ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

active1(p1(0)) -> mark1(0)
active1(p1(s1(X))) -> mark1(X)
active1(leq2(0, Y)) -> mark1(true)
active1(leq2(s1(X), 0)) -> mark1(false)
active1(leq2(s1(X), s1(Y))) -> mark1(leq2(X, Y))
active1(if3(true, X, Y)) -> mark1(X)
active1(if3(false, X, Y)) -> mark1(Y)
active1(diff2(X, Y)) -> mark1(if3(leq2(X, Y), 0, s1(diff2(p1(X), Y))))
active1(p1(X)) -> p1(active1(X))
active1(s1(X)) -> s1(active1(X))
active1(leq2(X1, X2)) -> leq2(active1(X1), X2)
active1(leq2(X1, X2)) -> leq2(X1, active1(X2))
active1(if3(X1, X2, X3)) -> if3(active1(X1), X2, X3)
active1(diff2(X1, X2)) -> diff2(active1(X1), X2)
active1(diff2(X1, X2)) -> diff2(X1, active1(X2))
p1(mark1(X)) -> mark1(p1(X))
s1(mark1(X)) -> mark1(s1(X))
leq2(mark1(X1), X2) -> mark1(leq2(X1, X2))
leq2(X1, mark1(X2)) -> mark1(leq2(X1, X2))
if3(mark1(X1), X2, X3) -> mark1(if3(X1, X2, X3))
diff2(mark1(X1), X2) -> mark1(diff2(X1, X2))
diff2(X1, mark1(X2)) -> mark1(diff2(X1, X2))
proper1(p1(X)) -> p1(proper1(X))
proper1(0) -> ok1(0)
proper1(s1(X)) -> s1(proper1(X))
proper1(leq2(X1, X2)) -> leq2(proper1(X1), proper1(X2))
proper1(true) -> ok1(true)
proper1(false) -> ok1(false)
proper1(if3(X1, X2, X3)) -> if3(proper1(X1), proper1(X2), proper1(X3))
proper1(diff2(X1, X2)) -> diff2(proper1(X1), proper1(X2))
p1(ok1(X)) -> ok1(p1(X))
s1(ok1(X)) -> ok1(s1(X))
leq2(ok1(X1), ok1(X2)) -> ok1(leq2(X1, X2))
if3(ok1(X1), ok1(X2), ok1(X3)) -> ok1(if3(X1, X2, X3))
diff2(ok1(X1), ok1(X2)) -> ok1(diff2(X1, X2))
top1(mark1(X)) -> top1(proper1(X))
top1(ok1(X)) -> top1(active1(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
            ↳ QDPOrderProof
          ↳ QDP
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

PROPER1(diff2(X1, X2)) -> PROPER1(X2)
PROPER1(leq2(X1, X2)) -> PROPER1(X1)
PROPER1(s1(X)) -> PROPER1(X)
PROPER1(leq2(X1, X2)) -> PROPER1(X2)
PROPER1(if3(X1, X2, X3)) -> PROPER1(X3)
PROPER1(if3(X1, X2, X3)) -> PROPER1(X1)
PROPER1(diff2(X1, X2)) -> PROPER1(X1)
PROPER1(if3(X1, X2, X3)) -> PROPER1(X2)
PROPER1(p1(X)) -> PROPER1(X)

The TRS R consists of the following rules:

active1(p1(0)) -> mark1(0)
active1(p1(s1(X))) -> mark1(X)
active1(leq2(0, Y)) -> mark1(true)
active1(leq2(s1(X), 0)) -> mark1(false)
active1(leq2(s1(X), s1(Y))) -> mark1(leq2(X, Y))
active1(if3(true, X, Y)) -> mark1(X)
active1(if3(false, X, Y)) -> mark1(Y)
active1(diff2(X, Y)) -> mark1(if3(leq2(X, Y), 0, s1(diff2(p1(X), Y))))
active1(p1(X)) -> p1(active1(X))
active1(s1(X)) -> s1(active1(X))
active1(leq2(X1, X2)) -> leq2(active1(X1), X2)
active1(leq2(X1, X2)) -> leq2(X1, active1(X2))
active1(if3(X1, X2, X3)) -> if3(active1(X1), X2, X3)
active1(diff2(X1, X2)) -> diff2(active1(X1), X2)
active1(diff2(X1, X2)) -> diff2(X1, active1(X2))
p1(mark1(X)) -> mark1(p1(X))
s1(mark1(X)) -> mark1(s1(X))
leq2(mark1(X1), X2) -> mark1(leq2(X1, X2))
leq2(X1, mark1(X2)) -> mark1(leq2(X1, X2))
if3(mark1(X1), X2, X3) -> mark1(if3(X1, X2, X3))
diff2(mark1(X1), X2) -> mark1(diff2(X1, X2))
diff2(X1, mark1(X2)) -> mark1(diff2(X1, X2))
proper1(p1(X)) -> p1(proper1(X))
proper1(0) -> ok1(0)
proper1(s1(X)) -> s1(proper1(X))
proper1(leq2(X1, X2)) -> leq2(proper1(X1), proper1(X2))
proper1(true) -> ok1(true)
proper1(false) -> ok1(false)
proper1(if3(X1, X2, X3)) -> if3(proper1(X1), proper1(X2), proper1(X3))
proper1(diff2(X1, X2)) -> diff2(proper1(X1), proper1(X2))
p1(ok1(X)) -> ok1(p1(X))
s1(ok1(X)) -> ok1(s1(X))
leq2(ok1(X1), ok1(X2)) -> ok1(leq2(X1, X2))
if3(ok1(X1), ok1(X2), ok1(X3)) -> ok1(if3(X1, X2, X3))
diff2(ok1(X1), ok1(X2)) -> ok1(diff2(X1, X2))
top1(mark1(X)) -> top1(proper1(X))
top1(ok1(X)) -> top1(active1(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].


The following pairs can be oriented strictly and are deleted.


PROPER1(diff2(X1, X2)) -> PROPER1(X2)
PROPER1(leq2(X1, X2)) -> PROPER1(X1)
PROPER1(s1(X)) -> PROPER1(X)
PROPER1(leq2(X1, X2)) -> PROPER1(X2)
PROPER1(if3(X1, X2, X3)) -> PROPER1(X3)
PROPER1(if3(X1, X2, X3)) -> PROPER1(X1)
PROPER1(diff2(X1, X2)) -> PROPER1(X1)
PROPER1(if3(X1, X2, X3)) -> PROPER1(X2)
The remaining pairs can at least be oriented weakly.

PROPER1(p1(X)) -> PROPER1(X)
Used ordering: Polynomial interpretation [21]:

POL(PROPER1(x1)) = x1   
POL(diff2(x1, x2)) = 1 + x1 + x2   
POL(if3(x1, x2, x3)) = 1 + x1 + x2 + x3   
POL(leq2(x1, x2)) = 1 + x1 + x2   
POL(p1(x1)) = x1   
POL(s1(x1)) = 1 + x1   

The following usable rules [14] were oriented: none



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
            ↳ QDPOrderProof
              ↳ QDP
                ↳ QDPOrderProof
          ↳ QDP
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

PROPER1(p1(X)) -> PROPER1(X)

The TRS R consists of the following rules:

active1(p1(0)) -> mark1(0)
active1(p1(s1(X))) -> mark1(X)
active1(leq2(0, Y)) -> mark1(true)
active1(leq2(s1(X), 0)) -> mark1(false)
active1(leq2(s1(X), s1(Y))) -> mark1(leq2(X, Y))
active1(if3(true, X, Y)) -> mark1(X)
active1(if3(false, X, Y)) -> mark1(Y)
active1(diff2(X, Y)) -> mark1(if3(leq2(X, Y), 0, s1(diff2(p1(X), Y))))
active1(p1(X)) -> p1(active1(X))
active1(s1(X)) -> s1(active1(X))
active1(leq2(X1, X2)) -> leq2(active1(X1), X2)
active1(leq2(X1, X2)) -> leq2(X1, active1(X2))
active1(if3(X1, X2, X3)) -> if3(active1(X1), X2, X3)
active1(diff2(X1, X2)) -> diff2(active1(X1), X2)
active1(diff2(X1, X2)) -> diff2(X1, active1(X2))
p1(mark1(X)) -> mark1(p1(X))
s1(mark1(X)) -> mark1(s1(X))
leq2(mark1(X1), X2) -> mark1(leq2(X1, X2))
leq2(X1, mark1(X2)) -> mark1(leq2(X1, X2))
if3(mark1(X1), X2, X3) -> mark1(if3(X1, X2, X3))
diff2(mark1(X1), X2) -> mark1(diff2(X1, X2))
diff2(X1, mark1(X2)) -> mark1(diff2(X1, X2))
proper1(p1(X)) -> p1(proper1(X))
proper1(0) -> ok1(0)
proper1(s1(X)) -> s1(proper1(X))
proper1(leq2(X1, X2)) -> leq2(proper1(X1), proper1(X2))
proper1(true) -> ok1(true)
proper1(false) -> ok1(false)
proper1(if3(X1, X2, X3)) -> if3(proper1(X1), proper1(X2), proper1(X3))
proper1(diff2(X1, X2)) -> diff2(proper1(X1), proper1(X2))
p1(ok1(X)) -> ok1(p1(X))
s1(ok1(X)) -> ok1(s1(X))
leq2(ok1(X1), ok1(X2)) -> ok1(leq2(X1, X2))
if3(ok1(X1), ok1(X2), ok1(X3)) -> ok1(if3(X1, X2, X3))
diff2(ok1(X1), ok1(X2)) -> ok1(diff2(X1, X2))
top1(mark1(X)) -> top1(proper1(X))
top1(ok1(X)) -> top1(active1(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].


The following pairs can be oriented strictly and are deleted.


PROPER1(p1(X)) -> PROPER1(X)
The remaining pairs can at least be oriented weakly.
none
Used ordering: Polynomial interpretation [21]:

POL(PROPER1(x1)) = x1   
POL(p1(x1)) = 1 + x1   

The following usable rules [14] were oriented: none



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
            ↳ QDPOrderProof
              ↳ QDP
                ↳ QDPOrderProof
                  ↳ QDP
                    ↳ PisEmptyProof
          ↳ QDP
          ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

active1(p1(0)) -> mark1(0)
active1(p1(s1(X))) -> mark1(X)
active1(leq2(0, Y)) -> mark1(true)
active1(leq2(s1(X), 0)) -> mark1(false)
active1(leq2(s1(X), s1(Y))) -> mark1(leq2(X, Y))
active1(if3(true, X, Y)) -> mark1(X)
active1(if3(false, X, Y)) -> mark1(Y)
active1(diff2(X, Y)) -> mark1(if3(leq2(X, Y), 0, s1(diff2(p1(X), Y))))
active1(p1(X)) -> p1(active1(X))
active1(s1(X)) -> s1(active1(X))
active1(leq2(X1, X2)) -> leq2(active1(X1), X2)
active1(leq2(X1, X2)) -> leq2(X1, active1(X2))
active1(if3(X1, X2, X3)) -> if3(active1(X1), X2, X3)
active1(diff2(X1, X2)) -> diff2(active1(X1), X2)
active1(diff2(X1, X2)) -> diff2(X1, active1(X2))
p1(mark1(X)) -> mark1(p1(X))
s1(mark1(X)) -> mark1(s1(X))
leq2(mark1(X1), X2) -> mark1(leq2(X1, X2))
leq2(X1, mark1(X2)) -> mark1(leq2(X1, X2))
if3(mark1(X1), X2, X3) -> mark1(if3(X1, X2, X3))
diff2(mark1(X1), X2) -> mark1(diff2(X1, X2))
diff2(X1, mark1(X2)) -> mark1(diff2(X1, X2))
proper1(p1(X)) -> p1(proper1(X))
proper1(0) -> ok1(0)
proper1(s1(X)) -> s1(proper1(X))
proper1(leq2(X1, X2)) -> leq2(proper1(X1), proper1(X2))
proper1(true) -> ok1(true)
proper1(false) -> ok1(false)
proper1(if3(X1, X2, X3)) -> if3(proper1(X1), proper1(X2), proper1(X3))
proper1(diff2(X1, X2)) -> diff2(proper1(X1), proper1(X2))
p1(ok1(X)) -> ok1(p1(X))
s1(ok1(X)) -> ok1(s1(X))
leq2(ok1(X1), ok1(X2)) -> ok1(leq2(X1, X2))
if3(ok1(X1), ok1(X2), ok1(X3)) -> ok1(if3(X1, X2, X3))
diff2(ok1(X1), ok1(X2)) -> ok1(diff2(X1, X2))
top1(mark1(X)) -> top1(proper1(X))
top1(ok1(X)) -> top1(active1(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
            ↳ QDPOrderProof
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

ACTIVE1(diff2(X1, X2)) -> ACTIVE1(X1)
ACTIVE1(if3(X1, X2, X3)) -> ACTIVE1(X1)
ACTIVE1(diff2(X1, X2)) -> ACTIVE1(X2)
ACTIVE1(leq2(X1, X2)) -> ACTIVE1(X1)
ACTIVE1(s1(X)) -> ACTIVE1(X)
ACTIVE1(leq2(X1, X2)) -> ACTIVE1(X2)
ACTIVE1(p1(X)) -> ACTIVE1(X)

The TRS R consists of the following rules:

active1(p1(0)) -> mark1(0)
active1(p1(s1(X))) -> mark1(X)
active1(leq2(0, Y)) -> mark1(true)
active1(leq2(s1(X), 0)) -> mark1(false)
active1(leq2(s1(X), s1(Y))) -> mark1(leq2(X, Y))
active1(if3(true, X, Y)) -> mark1(X)
active1(if3(false, X, Y)) -> mark1(Y)
active1(diff2(X, Y)) -> mark1(if3(leq2(X, Y), 0, s1(diff2(p1(X), Y))))
active1(p1(X)) -> p1(active1(X))
active1(s1(X)) -> s1(active1(X))
active1(leq2(X1, X2)) -> leq2(active1(X1), X2)
active1(leq2(X1, X2)) -> leq2(X1, active1(X2))
active1(if3(X1, X2, X3)) -> if3(active1(X1), X2, X3)
active1(diff2(X1, X2)) -> diff2(active1(X1), X2)
active1(diff2(X1, X2)) -> diff2(X1, active1(X2))
p1(mark1(X)) -> mark1(p1(X))
s1(mark1(X)) -> mark1(s1(X))
leq2(mark1(X1), X2) -> mark1(leq2(X1, X2))
leq2(X1, mark1(X2)) -> mark1(leq2(X1, X2))
if3(mark1(X1), X2, X3) -> mark1(if3(X1, X2, X3))
diff2(mark1(X1), X2) -> mark1(diff2(X1, X2))
diff2(X1, mark1(X2)) -> mark1(diff2(X1, X2))
proper1(p1(X)) -> p1(proper1(X))
proper1(0) -> ok1(0)
proper1(s1(X)) -> s1(proper1(X))
proper1(leq2(X1, X2)) -> leq2(proper1(X1), proper1(X2))
proper1(true) -> ok1(true)
proper1(false) -> ok1(false)
proper1(if3(X1, X2, X3)) -> if3(proper1(X1), proper1(X2), proper1(X3))
proper1(diff2(X1, X2)) -> diff2(proper1(X1), proper1(X2))
p1(ok1(X)) -> ok1(p1(X))
s1(ok1(X)) -> ok1(s1(X))
leq2(ok1(X1), ok1(X2)) -> ok1(leq2(X1, X2))
if3(ok1(X1), ok1(X2), ok1(X3)) -> ok1(if3(X1, X2, X3))
diff2(ok1(X1), ok1(X2)) -> ok1(diff2(X1, X2))
top1(mark1(X)) -> top1(proper1(X))
top1(ok1(X)) -> top1(active1(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].


The following pairs can be oriented strictly and are deleted.


ACTIVE1(diff2(X1, X2)) -> ACTIVE1(X1)
ACTIVE1(if3(X1, X2, X3)) -> ACTIVE1(X1)
ACTIVE1(diff2(X1, X2)) -> ACTIVE1(X2)
ACTIVE1(s1(X)) -> ACTIVE1(X)
ACTIVE1(p1(X)) -> ACTIVE1(X)
The remaining pairs can at least be oriented weakly.

ACTIVE1(leq2(X1, X2)) -> ACTIVE1(X1)
ACTIVE1(leq2(X1, X2)) -> ACTIVE1(X2)
Used ordering: Polynomial interpretation [21]:

POL(ACTIVE1(x1)) = x1   
POL(diff2(x1, x2)) = 1 + x1 + x2   
POL(if3(x1, x2, x3)) = 1 + x1   
POL(leq2(x1, x2)) = x1 + x2   
POL(p1(x1)) = 1 + x1   
POL(s1(x1)) = 1 + x1   

The following usable rules [14] were oriented: none



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
            ↳ QDPOrderProof
              ↳ QDP
                ↳ QDPOrderProof
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

ACTIVE1(leq2(X1, X2)) -> ACTIVE1(X1)
ACTIVE1(leq2(X1, X2)) -> ACTIVE1(X2)

The TRS R consists of the following rules:

active1(p1(0)) -> mark1(0)
active1(p1(s1(X))) -> mark1(X)
active1(leq2(0, Y)) -> mark1(true)
active1(leq2(s1(X), 0)) -> mark1(false)
active1(leq2(s1(X), s1(Y))) -> mark1(leq2(X, Y))
active1(if3(true, X, Y)) -> mark1(X)
active1(if3(false, X, Y)) -> mark1(Y)
active1(diff2(X, Y)) -> mark1(if3(leq2(X, Y), 0, s1(diff2(p1(X), Y))))
active1(p1(X)) -> p1(active1(X))
active1(s1(X)) -> s1(active1(X))
active1(leq2(X1, X2)) -> leq2(active1(X1), X2)
active1(leq2(X1, X2)) -> leq2(X1, active1(X2))
active1(if3(X1, X2, X3)) -> if3(active1(X1), X2, X3)
active1(diff2(X1, X2)) -> diff2(active1(X1), X2)
active1(diff2(X1, X2)) -> diff2(X1, active1(X2))
p1(mark1(X)) -> mark1(p1(X))
s1(mark1(X)) -> mark1(s1(X))
leq2(mark1(X1), X2) -> mark1(leq2(X1, X2))
leq2(X1, mark1(X2)) -> mark1(leq2(X1, X2))
if3(mark1(X1), X2, X3) -> mark1(if3(X1, X2, X3))
diff2(mark1(X1), X2) -> mark1(diff2(X1, X2))
diff2(X1, mark1(X2)) -> mark1(diff2(X1, X2))
proper1(p1(X)) -> p1(proper1(X))
proper1(0) -> ok1(0)
proper1(s1(X)) -> s1(proper1(X))
proper1(leq2(X1, X2)) -> leq2(proper1(X1), proper1(X2))
proper1(true) -> ok1(true)
proper1(false) -> ok1(false)
proper1(if3(X1, X2, X3)) -> if3(proper1(X1), proper1(X2), proper1(X3))
proper1(diff2(X1, X2)) -> diff2(proper1(X1), proper1(X2))
p1(ok1(X)) -> ok1(p1(X))
s1(ok1(X)) -> ok1(s1(X))
leq2(ok1(X1), ok1(X2)) -> ok1(leq2(X1, X2))
if3(ok1(X1), ok1(X2), ok1(X3)) -> ok1(if3(X1, X2, X3))
diff2(ok1(X1), ok1(X2)) -> ok1(diff2(X1, X2))
top1(mark1(X)) -> top1(proper1(X))
top1(ok1(X)) -> top1(active1(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].


The following pairs can be oriented strictly and are deleted.


ACTIVE1(leq2(X1, X2)) -> ACTIVE1(X1)
ACTIVE1(leq2(X1, X2)) -> ACTIVE1(X2)
The remaining pairs can at least be oriented weakly.
none
Used ordering: Polynomial interpretation [21]:

POL(ACTIVE1(x1)) = x1   
POL(leq2(x1, x2)) = 1 + x1 + x2   

The following usable rules [14] were oriented: none



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
            ↳ QDPOrderProof
              ↳ QDP
                ↳ QDPOrderProof
                  ↳ QDP
                    ↳ PisEmptyProof
          ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

active1(p1(0)) -> mark1(0)
active1(p1(s1(X))) -> mark1(X)
active1(leq2(0, Y)) -> mark1(true)
active1(leq2(s1(X), 0)) -> mark1(false)
active1(leq2(s1(X), s1(Y))) -> mark1(leq2(X, Y))
active1(if3(true, X, Y)) -> mark1(X)
active1(if3(false, X, Y)) -> mark1(Y)
active1(diff2(X, Y)) -> mark1(if3(leq2(X, Y), 0, s1(diff2(p1(X), Y))))
active1(p1(X)) -> p1(active1(X))
active1(s1(X)) -> s1(active1(X))
active1(leq2(X1, X2)) -> leq2(active1(X1), X2)
active1(leq2(X1, X2)) -> leq2(X1, active1(X2))
active1(if3(X1, X2, X3)) -> if3(active1(X1), X2, X3)
active1(diff2(X1, X2)) -> diff2(active1(X1), X2)
active1(diff2(X1, X2)) -> diff2(X1, active1(X2))
p1(mark1(X)) -> mark1(p1(X))
s1(mark1(X)) -> mark1(s1(X))
leq2(mark1(X1), X2) -> mark1(leq2(X1, X2))
leq2(X1, mark1(X2)) -> mark1(leq2(X1, X2))
if3(mark1(X1), X2, X3) -> mark1(if3(X1, X2, X3))
diff2(mark1(X1), X2) -> mark1(diff2(X1, X2))
diff2(X1, mark1(X2)) -> mark1(diff2(X1, X2))
proper1(p1(X)) -> p1(proper1(X))
proper1(0) -> ok1(0)
proper1(s1(X)) -> s1(proper1(X))
proper1(leq2(X1, X2)) -> leq2(proper1(X1), proper1(X2))
proper1(true) -> ok1(true)
proper1(false) -> ok1(false)
proper1(if3(X1, X2, X3)) -> if3(proper1(X1), proper1(X2), proper1(X3))
proper1(diff2(X1, X2)) -> diff2(proper1(X1), proper1(X2))
p1(ok1(X)) -> ok1(p1(X))
s1(ok1(X)) -> ok1(s1(X))
leq2(ok1(X1), ok1(X2)) -> ok1(leq2(X1, X2))
if3(ok1(X1), ok1(X2), ok1(X3)) -> ok1(if3(X1, X2, X3))
diff2(ok1(X1), ok1(X2)) -> ok1(diff2(X1, X2))
top1(mark1(X)) -> top1(proper1(X))
top1(ok1(X)) -> top1(active1(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

TOP1(ok1(X)) -> TOP1(active1(X))
TOP1(mark1(X)) -> TOP1(proper1(X))

The TRS R consists of the following rules:

active1(p1(0)) -> mark1(0)
active1(p1(s1(X))) -> mark1(X)
active1(leq2(0, Y)) -> mark1(true)
active1(leq2(s1(X), 0)) -> mark1(false)
active1(leq2(s1(X), s1(Y))) -> mark1(leq2(X, Y))
active1(if3(true, X, Y)) -> mark1(X)
active1(if3(false, X, Y)) -> mark1(Y)
active1(diff2(X, Y)) -> mark1(if3(leq2(X, Y), 0, s1(diff2(p1(X), Y))))
active1(p1(X)) -> p1(active1(X))
active1(s1(X)) -> s1(active1(X))
active1(leq2(X1, X2)) -> leq2(active1(X1), X2)
active1(leq2(X1, X2)) -> leq2(X1, active1(X2))
active1(if3(X1, X2, X3)) -> if3(active1(X1), X2, X3)
active1(diff2(X1, X2)) -> diff2(active1(X1), X2)
active1(diff2(X1, X2)) -> diff2(X1, active1(X2))
p1(mark1(X)) -> mark1(p1(X))
s1(mark1(X)) -> mark1(s1(X))
leq2(mark1(X1), X2) -> mark1(leq2(X1, X2))
leq2(X1, mark1(X2)) -> mark1(leq2(X1, X2))
if3(mark1(X1), X2, X3) -> mark1(if3(X1, X2, X3))
diff2(mark1(X1), X2) -> mark1(diff2(X1, X2))
diff2(X1, mark1(X2)) -> mark1(diff2(X1, X2))
proper1(p1(X)) -> p1(proper1(X))
proper1(0) -> ok1(0)
proper1(s1(X)) -> s1(proper1(X))
proper1(leq2(X1, X2)) -> leq2(proper1(X1), proper1(X2))
proper1(true) -> ok1(true)
proper1(false) -> ok1(false)
proper1(if3(X1, X2, X3)) -> if3(proper1(X1), proper1(X2), proper1(X3))
proper1(diff2(X1, X2)) -> diff2(proper1(X1), proper1(X2))
p1(ok1(X)) -> ok1(p1(X))
s1(ok1(X)) -> ok1(s1(X))
leq2(ok1(X1), ok1(X2)) -> ok1(leq2(X1, X2))
if3(ok1(X1), ok1(X2), ok1(X3)) -> ok1(if3(X1, X2, X3))
diff2(ok1(X1), ok1(X2)) -> ok1(diff2(X1, X2))
top1(mark1(X)) -> top1(proper1(X))
top1(ok1(X)) -> top1(active1(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.